Icosahedral Polyhedra from D6 Lattice and Danzer’s ABCK Tiling
نویسندگان
چکیده
منابع مشابه
Tiling Polyhedra with Tetrahedra
When solving an algorithmic problem involving a polyhedron in R, it is common to start by partitioning the given polyhedron into simplier ones. The most common process is called triangulation and it refers to partitioning a polyhedron into tetrahedra in a face-to-face manner. In this paper instead of triangulations we will consider tilings by tetrahedra. In a tiling the tetrahedra are not requi...
متن کاملFace-Transitive Polyhedra with Rectangular Faces and Icosahedral Symmetry
We describe three hexacontahedra in which the faces are rectangles, all equivalent under symmetries of the icosahedral group and having all edges in the mirror planes of the symmetry group. Under the restriction that adjacent faces are not coplanar, these are the only possible polyhedra of this kind.
متن کاملLattice Polyhedra and Submodular Flows
Lattice polyhedra, as introduced by Gröflin and Hoffman, form a common framework for various discrete optimization problems. They are specified by a lattice structure on the underlying matrix satisfying certain suband supermodularity constraints. Lattice polyhedra provide one of the most general frameworks of total dual integral systems. So far no combinatorial algorithm has been found for the ...
متن کامل2-Lattice Polyhedra: Duality
This is the first in a series of papers that explores a class of polyhedra we call 2-lattice polyhedra. 2-Lattice polyhedra are a special class of lattice polyhedra that include network flow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, the intersection of two polymatroids, etc. In this paper we show that the maximum sum of components of a vector in a 2-lattice polyh...
متن کاملLattice closures of polyhedra
Given P ⊂ R, a mixed integer set P I = P ∩ (Z × Rn−t), and a k-tuple of n-dimensional integral vectors (π1, . . . , πk) where the last n− t entries of each vector is zero, we consider the relaxation of P I obtained by taking the convex hull of points x in P for which π 1 x, . . . , π T k x are integral. We then define the k-dimensional lattice closure of P I to be the intersection of all such r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12121983